What (who) is task scheduling - definition
IN COMPUTING, WHAT CARRIES OUT THE SCHEDULING ACTIVITY
Scheduler pattern; Scheduling algorithm; Task scheduling; Scheduling discipline; Scheduling disciplines; CPU scheduler; Task scheduler; Process scheduling; CPU Scheduling; Packet scheduling; Channel-dependent scheduling; Scheduling algorithms; Scheduling theory; Process scheduler; Scheduling priority; Processor scheduling; Deterministic Scheduling; Non-deterministic Scheduling; Nondeterministic Scheduling; Non-Deterministic Scheduling; Scheduling policy; Process Scheduler; Linux Process Scheduler; Dispatch latency; Task queue; Running queue; Scheduler (computing); Long-term scheduler; Admission scheduler; Short-term scheduler; Medium-term scheduler; Processor time; Fixed priority scheduling class; Time-sharing scheduling class; Fair share scheduling class; High-level scheduler; Long-term scheduling; Admission scheduling; High-level scheduling; Mid-term scheduler; Mid-term scheduling; Medium-term scheduling; Short-term scheduling; CPU scheduling
![packet schedulers]]](https://commons.wikimedia.org/wiki/Special:FilePath/Simplified Structure of the Linux Kernel.svg?width=200 "packet schedulers]]")
![A sample [[thread pool]] (green boxes) with a queue (FIFO) of waiting tasks (blue) and a queue of completed tasks (yellow)](https://commons.wikimedia.org/wiki/Special:FilePath/Thread pool.svg?width=200 "A sample [[thread pool]] (green boxes) with a queue (FIFO) of waiting tasks (blue) and a queue of completed tasks (yellow)")
task scheduling
<algorithm> The assignment of start and end times to a set of
tasks, subject to certain constraints. Constraints are
typically either time constraints (the payload must be
installed before the payload bay doors are closed) or resource
constraints (this task requires a small crane and a crane
operator).
In the case where the tasks are programs to run concurrently
on a computer, this is also known as multitasking.
(1998-04-25)
Parallel task scheduling
THEORETICAL COMPUTER SCIENCE
Draft:Parallel task scheduling problem; Parallel task scheduling problem
Parallel task scheduling (also called parallel job scheduling or parallel processing scheduling) is an optimization problem in computer science and operations research. It is a variant of optimal job scheduling.
Scheduling Open Service Interface Definition
AN OPEN KNOWLEDGE INITIATIVE SPECIFICATION; PROGRAMMATIC INTERFACES WHICH COMPRISE A SERVICE-ORIENTED ARCHITECTURE FOR DESIGNING AND BUILDING REUSABLE AND INTEROPERABLE SOFTWARE
Scheduling OSID
The Scheduling Open Service Interface Definition (OSID) is an Open Knowledge Initiative specification. OSIDs are programmatic interfaces which comprise a service-oriented architecture for designing and building reusable and interoperable software.
Wikipedia
Scheduling (computing)
In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows.
The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service.
Scheduling is fundamental to computation itself, and an intrinsic part of the execution model of a computer system; the concept of scheduling makes it possible to have computer multitasking with a single central processing unit (CPU).
